A game theory‐based route planning approach for automated vehicle collection

We consider a shared transportation system in an urban environment where human drivers collect vehicles that are no longer being used. Each driver, also called platoon leader, is charge of driving collected as to bring them back some given location (e.g., airport, railway station). Platoon allocation and route planning for picking up returning automated one the major issues systems need be addressed. In this article, we propose coalition game approach compute (1) unused minimal number platoons, (2) optimized tour each platoon, (3) minimum energy consumed all these vehicles. game, players parked vehicles, coalitions platoons formed. This player joins maximizes its payoff, converges stable solution. The quality solution obtained evaluated with regard three optimization criteria complexity measured by computation time required. Simulation experiments carried out various configurations. They show very efficient solve multiobjective problem considered, since it provides optimal less than second 300 collected, considerably outperforms other well-known approaches such particle swarm nondominated sorting genetic algorithm.